Branch Less, Cut More and Schedule Jobs with Release and Delivery Times on Uniform Machines

We consider the problem of scheduling n jobs with identical processing times and given release as well delivery on m uniform machines. The goal is to minimize makespan, i.e., maximum full completion time any job. This well-known have an open complexity status even if number fixed. present a polynomial-time algorithm for which based earlier introduced algorithmic framework blesscmore (“branch less cut more”). extend analysis so-called behavior alternatives developed version parallel machines show how used technique can be extended machine environment special condition job parameters imposed. proposed O(γm2nlogn), where γ either or qmax. reduced further by using smaller κ<n in estimation describing particular types. However, this κ becomes only known when has terminated.